Recycling Bi-Lanczos Algorithms: BiCG, CGS, and BiCGSTAB
نویسنده
چکیده
Engineering problems frequently require solving a sequence of dual linear systems. This paper introduces recycling BiCG, that recycles the Krylov subspace from one pair of linear systems to the next pair. Augmented bi-Lanczos algorithm and modified two-term recurrence are developed for using the recycle space. Recycle space is built from the approximate invariant subspace corresponding to eigenvalues close to the origin. Recycling approach is extended to the CGS and the BiCGSTAB algorithms. Experiments on a convection-diffusion problem give promising results.
منابع مشابه
Recycling BiCG with an Application to Model Reduction
Science and engineering problems frequently require solving a sequence of dual linear systems. Besides having to store only few Lanczos vectors, using the BiConjugate Gradient method (BiCG) to solve dual linear systems has advantages for specific applications. For example, using BiCG to solve the dual linear systems arising in interpolatory model reduction provides a backward error formulation ...
متن کاملComputational variants of the CGS and BiCGstab methods
The CGS and BiCGstab algorithms were derived by their authors from the bi-conjugate gradient iteration. In this paper a derivation from the (unnormalized) Lanczos algorithm is given. Experimental results are given, showing that these methods offer no immediate advantage over their earlier counterparts.
متن کاملA stabilized GPBiCG method with a strategy to remedy accuracy of Bi-CG coefficients for solving linear systems
Bi-conjugate gradient (Bi-CG) is a well-known method for solving linear systems Ax = b for x, where A is a given n-by-n matrix, and b a given n-vector. A number of hybrid Bi-CG methods such as conjugate gradient squared (CGS), Bi-CG STABilized (Bi-CGSTAB), BiCGStab2, BiCGstab(`), Generalized Product-type Bi-CG (GPBiCG), and BiCG×MR2 have been developed to improve the convergence of Bi-CG and to...
متن کاملRecycling BiCGSTAB with an Application to Parametric Model Order Reduction
Krylov subspace recycling is a process for accelerating the convergence of sequences of linear systems. Based on this technique we have recently developed the recycling BiCG algorithm. We now generalize and extend this recycling theory to BiCGSTAB. Recycling BiCG focuses on efficiently solving sequences of dual linear systems, while the focus here is on efficiently solving sequences of single l...
متن کاملAn Overview of Approaches for the StableComputation of Hybrid
It is well-known that BiCG can be adapted so that the operations with A T can be avoided, and hybrid methods with computational complexity almost similar to BiCG can be constructed in a further attempt to improve the convergence behavior. Examples of this are CGS, Bi-CGSTAB, and BiCGstab(`). In many applications, the speed of convergence of these methods is very dependent on the incorporated Bi...
متن کامل